Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RELIABILITY-BASED DESIGN OPTIMIZATION OF COMPLEX FUNCTIONS USING SELF-ADAPTIVE PARTICLE SWARM OPTIMIZATION METHOD

A Reliability-Based Design Optimization (RBDO) framework is presented that accounts for stochastic variations in structural parameters and operating conditions. The reliability index calculation is itself an iterative process, potentially employing an optimization technique to find the shortest distance from the origin to the limit-state boundary in a standard normal space. Monte Carlo simulati...

متن کامل

Vector Quantization Based on Self-Adaptive Particle Swarm Optimization

This article presents a fuzzy self-adaptive particle swarm optimization (FSAPSO) learning algorithm to extract a near optimum codebook of vector quantization (VQ) for carrying on image compression. The fuzzy self-adaptive particle swarm optimization vector quantization (FSAPSOVQ) learning schemes, combined advantages of the fuzzy inference method (FIM), the simple VQ concept and the efficient s...

متن کامل

Chaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks

Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...

متن کامل

Stopping Criteria for a Constrained Single-Objective Particle Swarm Optimization Algorithm

When using optimization algorithms the goal is usually clear: The global optimum should be found. However, in general it is not clear when this goal is achieved, especially if real-world problems are optimized for which no knowledge about the global optimum is available. Therefore, it is not easy to decide when the execution of an optimization algorithm should be terminated. Although different ...

متن کامل

Run Time Analysis regarding Stopping Criteria for Differential Evolution and Particle Swarm Optimization

Due to the growing complexity of todays technical systems optimization is becoming an important issue within the design phase. The applicability of optimization algorithms in automatic design processes is strongly dependent on the stopping criterion. It is important that the optimum is reliably found but furthermore no time or computational resources should be wasted. Therefore a run time analy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Swarm Intelligence

سال: 2020

ISSN: 1935-3812,1935-3820

DOI: 10.1007/s11721-020-00185-z